Logic-Based Benders Decomposition for Multiagent Scheduling with Sequence-dependent Costs
نویسندگان
چکیده
منابع مشابه
Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty
Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...
متن کاملLogic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups
We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. This approach is a hybrid model that makes use of a mixed integer programming master problem and a specialized solver for travelling salesman subproblems. The master problem is used to assign jobs to machine...
متن کاملA Logic-Based Benders Approach to Scheduling with Alternative Resources and Setup Times
We study an unrelated parallel machines scheduling problem with sequence and machine dependent setup times. A logicbased Benders decomposition approach is proposed to minimize the makespan. The decomposition approach is a hybrid model that makes use of a mixed integer programming master problem and a travelling salesman problem subproblem. The master problem is a relaxation of the problem and i...
متن کاملMixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
A recent paper by Heinz and Beck (CPAIOR 2012) found that mixed integer software has become competitive with or superior to logic-based Benders decomposition for the solution of facility assignment and scheduling problems. Their implementation of Benders differs, however, from that described in the literature they cite and therefore results in much slower performance than previously reported. W...
متن کاملSingle-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition
We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.
متن کامل